The weak pigeonhole principle for function classes in S^1_2
نویسندگان
چکیده
It is well known that S1 2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S1 2 for provably weaker function classes. §
منابع مشابه
Circuit principles and weak pigeonhole variants 1
This paper considers the relational versions of the surjective, partial surjective, and multifunction weak pigeonhole principles for PV , Σ1, Π b 1, and B(Σ b 1)-formulas as well as relativizations of these formulas to higher levels of the bounded arithmetic hierarchy. We show that the partial surjective weak pigeonhole principle for Π1 formulas implies that for each k there is a string of leng...
متن کاملCircuit Principles and Weak Pigeonhole Variants
This paper considers the relational versions of the surjective and multifunction weak pigeonhole principles for PV , Σ1 and Θ b 2-formulas. We show that the relational surjective pigeonhole principle for Θ2 formulas in S 1 2 implies a circuit block-recognition principle which in turn implies the surjective weak pigeonhole principle for Σ1 formulas. We introduce a class of predicates correspondi...
متن کامل$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...
متن کاملP != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...
متن کاملApproximate counting in bounded arithmetic
We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV )), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP , APP , MA, AM ) in PV1 + dWPHP(PV ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 52 شماره
صفحات -
تاریخ انتشار 2006